Translating Single-Player GDL into PDDL
نویسندگان
چکیده
In the single-agent case general game playing and action planning are two related topics, so that one might hope to use the established planners to improve the handling of general single-player games. However, both come with their own description language, GDL and PDDL, respectively. In this paper we propose a way to translate single-player games described in GDL to PDDL planning tasks and provide an evaluation on a wide range of single-player games, comparing the efficiency of grounding and solving the games in the translated and in the original format.
منابع مشابه
Answer Set Programming for Single-Player Games in General Game Playing
As a novel, grand AI challenge, General Game Playing is concerned with the development of systems that understand the rules of unknown games and play these games well without human intervention. In this paper, we show how Answer Set Programming can assist a general game player with the special class of single-player games. To this end, we present a translation from the general Game Description ...
متن کاملGDL-III: A Proposal to Extend the Game Description Language to General Epistemic Games
We propose an extension of the standard game description language for general game playing to include epistemic games, which are characterised by rules that depend on the knowledge of players. A single additional keyword suffices to define GDL-III, a general description language for games with imperfect information and introspection. We present an Answer Set Program for automatically reasoning ...
متن کاملPast, Present, and Future: An Optimal Online Algorithm for Single-Player GDL-II Games
In General Game Playing, a player receives the rules of an unknown game and attempts to maximize his expected reward. Since 2011, the GDL-II rule language extension allows the formulation of nondeterministic and partially observable games. In this paper, we present an algorithm for such games, with a focus on the single-player case. Conceptually, at each stage, the proposed NORNS algorithm dist...
متن کاملConcise finite-domain representations for PDDL planning tasks
We introduce an efficient method for translating planning tasks specified in the standard PDDL formalism into a concise grounded representation that uses finite-domain state variables instead of the straight-forward propositional encoding. Translation is performed in four stages. Firstly, we transform the input task into an equivalent normal form expressed in a restricted fragment of PDDL. Seco...
متن کاملSolving Planning Problems Using Real-Time Model Checking (Translating PDDL3 into Timed Automata)
We present a translation for the variant PDDL 3 of PDDL (Planning Domain Definition Language) into Timed Automata. The advantage of having such a translation is the availability of tool support by modelcheckers. We present a case study in which we apply a version of UPPAAL that has been extended for the search of cost-optimal solutions.
متن کامل